Generating r-regular graphs
نویسندگان
چکیده
For each nonnegative integer r we determine a set of graph operations such that all r regular loopless graphs can be generated from the smallest r regular loopless graphs by using these operations We also discuss possible extensions of this result to r regular graphs of girth at least g for each xed g
منابع مشابه
D-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملCounting Independent Sets in Some Classes of (almost) Regular Graphs
We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some cases, construct the corresponding bijections.
متن کاملGenerating 4-regular Hamiltonian Plane Graphs
This paper describes the study of a special class of 4-regular plane graphs which are Hamiltonian. These graphs are of special interest in knot theory. An algorithm is presented that randomly generates such graphs with n vertices with a fixed (and oriented) Hamiltonian cycle in O(n) time. An exact count of the number of such graphs with n vertices is obtained and the asymptotic growth rate of t...
متن کاملRandom Regular Graph: Generation and Cover Time
A graph is r-regular if all its vertices have the same degree r. A random r-regular graph with n vertices is a graph sampled uniformly at random from the set of all r-regular graphs on n vertices. There are various sampling methods for this. In this report we survey one of them: The Configuration Model. We then survey the cover time of a random walk on such a graph, which roughly speaking, is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 129 شماره
صفحات -
تاریخ انتشار 2003